3× 3 Minors of Catalecticants

نویسنده

  • CLAUDIU RAICU
چکیده

Secant varieties to Veronese embeddings of projective space are classical varieties whose equations are not completely understood. Minors of catalecticant matrices furnish some of their equations, and in some situations even generate their ideals. Geramita conjectured that this is the case for the secant line variety of the Veronese variety, namely that its ideal is generated by the 3×3 minors of any of the “middle” catalecticants. Part of this conjecture is the statement that the ideals of 3×3 minors are equal for most catalecticants, and this was known to hold set-theoretically. We prove the equality of 3× 3 minors and derive Geramita’s conjecture as a consequence of previous work by Kanev.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of self-control and metacognition components in normal minors and juvenile delinquents at correction and rehabilitation centers

Self-control and cognition are among the factors involved in the tendency toward delinquency. The aim of this study was to compare self-control and metacognition components in normal minors and juvenile delinquents at correction and rehabilitation centers. This was a causal-comparative descriptive study. The statistical sample included 70 juvenile delinquents (55 boys and 15 girls), selected...

متن کامل

On Representable Matroids Having Neither U2,5– Nor U3,5–minors

Consider 3–connected matroids that are neither binary nor ternary and have neither U2,5– nor U3,5–minors: for example, AG(3, 2)′, the matroid obtained by relaxing a circuit-hyperplane of AG(3, 2). The main result of the paper shows that no matroid of this sort is representable over any field. This result makes it possible to extend known characterisations of the binary and ternary matroids repr...

متن کامل

On the Positive Harris Recurrence for Multiclass Queueing Networks: a Uniied Approach via Uid Limit Models

A heavy traac limit theorem for networks of queues with multiple customer types. 27 We now compute the principal minors of D k 2 and D k 3. First consider D k 2. All the principal minors of order 2 are equal to 1. The principal minor corresponding to f1; 3; 4g is equal to 1 + 3 1 3 4 == 2 , and the remaining principal minors of order 3 are equal to 1. The determinant of the matrix itself is 1 ?...

متن کامل

On 3-Connected Graphs of Path-Width at Most Three

It is known that the list of excluded minors for the minor-closed class of graphs of path-width 6 3 numbers in the millions. However, if we restrict the class to 3-connected graphs of path-width 6 3, then we can characterize it by five excluded minors.

متن کامل

Arrangements and Amounts of Equal Minors in Totally Positive Matrices

Understanding the positive Grassmannian has been a highly significant question in mathematics for several decades. We discuss arrangements of equal minors in the totally positive Grassmannian. It was previously shown that arrangements of equals minors of largest value correspond to the simplices in Sturmfels triangulation. Here we discuss arrangements of equals minors of second largest value, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010